Indexes and Algorithms for Scalable and Flexible Instant Overview Search

نویسندگان

  • Pavlos Fafalios
  • Yannis Tzitzikas
  • Dimitris Plexousakis
  • Constantine Stephanidis
  • Angelos Bilas
چکیده

There is an increasing interest on recommending to the user instantly (during typing characters) queries and query results. This is evidenced by the emergence of several systems that offer such functionalities (e.g. Google Instant Search, Facebook for social searching, IMDB for movie searching, etc). In this thesis we consider more informative recommendations based on various precomputed aggregated information. Such recommendations can accommodate the products of various services like autocompletion, search-as-you-type, results clustering, faceted search, entity mining, etc. The instant presentation of these recommendations helps the user (a) to discover fast what is popular among other users, (b) to decide fast which (of the suggested) query completions to use, and (c) to decide what hits of the returned answer to inspect. In this thesis we focus on making this feasible (scalable) and flexible. Regarding scalability we elaborate on an approach based on precomputed information and we comparatively evaluate various triebased index structures for making real-time interaction feasible, even if the size of the available memory space is limited. For improving the throughput that can be served we analyze and experimentally evaluate various caching policies. We report performance results over a server running on a modest personal computer (with 3 GB main memory) that provides instant services (in less than 140 ms) for millions of distinct queries and terabytes of precomputed information. As regards flexibility, in order to reduce user’s effort and to increase the exploitation of the precomputed information, we elaborate on how the recommendations can tolerate different word orders and spelling errors, assuming the proposed trie-based index structures. The experimental results revealed that such functionality significantly increases the number of recommendations especially for queries that contain several words. Euret ria kai Algìrijmoi gia Klimak ̧simh kai Euèlikth StigmiaÐa Episkopik Anaz thsh

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimality of the flexible job shop scheduling system based on Gravitational Search Algorithm

The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...

متن کامل

Optimality of the flexible job shop scheduling system based on Gravitational Search Algorithm

The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...

متن کامل

Cost Effective and Scalable Synthesis of MnO2 Doped Graphene in a Carbon Fiber/PVA: Superior Nanocomposite for High Performance Flexible Supercapacitors

In the current study, we report new flexible, free standing and high performance electrodes for electrochemical supercapacitors developed througha scalable but simple and efficient approach. Highly porous structures based on carbon fiber and poly (vinyl alcohol) (PVA) were used as a pattern. The electrochemical performances of Carbon fiber/GO-MnO2/CNT supercapacitors were characteriz...

متن کامل

Improved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems

Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...

متن کامل

Intelligent scalable image watermarking robust against progressive DWT-based compression using genetic algorithms

Image watermarking refers to the process of embedding an authentication message, called watermark, into the host image to uniquely identify the ownership. In this paper a novel, intelligent, scalable, robust wavelet-based watermarking approach is proposed. The proposed approach employs a genetic algorithm to find nearly optimal positions to insert watermark. The embedding positions coded as chr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012